Negation in Logic Programming: A Formalization in Constructive Logic

The conventional formalization of logic programming in classical logic explains very convincingly the basic principles of this programming style. However, it gives no easy or intuitive explanations for the treatment of negation. Logic Programming handles negation through the so-called ^Negation as Failure" inference principle which is rather unconventional from the viewpoint of classical logic. Despite its nonclas-sical nature, this inference principle cannot be avoided in practice. The appropriate application of Negation as Failure requires either syntactical restrictions, or significant changes in the semantics of logic programs. In this article, we defend the thesis that these syntactical restrictions or semantical changes are naturally and simply explained by observing that logic programming in fact implements no more than a constructive fragment of classical logic. Relying on a "Conditional Fixpoint Procedure", we first define a monotonic inference procedure for logic programs with negation that are consistent in this constructive fragment. Then we show how this procedure can be extended into a "Temary Fixpoint Procedure" for general programs. This fixpoint procedure defines a temary logic semantics for syntactically unrestricted logic programs. Finally, we argue that the constructive interpretation of logic programming also gives a simple and natural explanation of meta-programming. Relying on this view of meta-programming, we specify different forms of reflective reasoning, in particular default reasoning.